Graph optimization algorithm for low-latency interconnection networks
نویسندگان
چکیده
منابع مشابه
A Synthesis Algorithm for Reconfigurable Interconnection Networks
The performance of a parallel algorithm depends in part on the interconnection topology of the target parallel system. An interconnection network is called reconfigurable if its topol-ogy can be changed between different algorithm executions. Since communication patterns vary from one parallel algorithm to another, a reconfigurable network can effectively support algorithms with different commu...
متن کاملBroadcasting on Incomplete Star Graph Interconnection Networks
In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete star graphs. A n incomplete star graph with N nodes, where (n l ) ! < N < n! , is a subgraph of an n-star. Using a routing scheme to transmit a message to each substar composed of the incomplete star, our proposed broadcasting algorithm is optimal in O(n1ogn) on the single-port communication model. While broa...
متن کاملInterconnection networks: graph– and group–theoretic modelling
The present paper surveys recent and promising results about graph–theoretic and group–theoretic modelling in distributed computing. The specific behaviour of various classes of networks (Cayley and Borel Cayley networks, de Bruijn and Kautz networks, etc.) is studied in terms of usual efficiency requirements, such as computability, symmetry, uniformity and algebraic structure, ease of routing,...
متن کاملCayley Graph Techniques for Permutation Routing on Bus Interconnection Networks
Cayley graphs and elementary group theory are used to eeciently nd minimum length permutation routes in a bus interconnection network. Cayley graphs have been used extensively to design interconnection networks and provide a natural setting for studying point-to-point routing 1, 2, 3, 4], but the technique has not been widely used for the more important problem of permutation routing. This is d...
متن کاملOn the Communication Latency of Wormhole Routed Interconnection Networks
Several analytical models have been proposed in the literature for wormhole -routed multicomputers. However, all these models have been discussed in the context of unicast communication and there has been comparatively little activity in the area of analytical modelling of collective communication algorithms like broadcast. To our best knowledge, this paper presents the first analytical model t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2021
ISSN: 0167-8191
DOI: 10.1016/j.parco.2021.102805